
public class QueueDelegator<V extends Vertex<V>> implements DataStructure<V>{
	private java.util.LinkedList<Path<V>> list;
	
	public QueueDelegator()
	{
		 list = new java.util.LinkedList<Path<V>>();
	}

	public java.util.LinkedList<Path<V>> getList() {
		return list;
	}

	public void setList(java.util.LinkedList<Path<V>> list) {
		this.list = list;
	}

	@Override
	public void add(Path<V> path) {
		list.add(path);
		
	}

	@Override
	public Path<V> remove() {
		return list.remove();
	}

	@Override
	public boolean isEmpty() {
		return list.isEmpty();
	}
}
